A O(log2 n) Fault-Tolerant Distributed Mutual Exclusion Algorithm Based on Open-Cube Structure
نویسندگان
چکیده
A new distributed mutual exclusion algorithm, using a token and based upon an original rooted tree structure, is presented. The rooted tree introduced. named “open-cube“ , has noteworthy stability and locality properties, allowing the proposed algorithm to achieve good perfotmances and high tolerance to node failures: the worst case message complexity per request is, in the absence of node failures, logp+l where n is the number of nodes, whereas O(1og.p) extra messages in the average are necessary to tolerate each node failure. This algorithm is a particular instance of a general scheme for token and tree-based distributed mutual exclusion algorithms, previously presented in part by the authors; comequently, its safe9 and liveness properties are inherited from the general one; however. the preseM paper is self-contained.
منابع مشابه
Fault-Tolerant Sorting Networks
This thesis studies sorting circuits, networks, and PRAM algorithms that are tolerant to faults. We consider both worst-case and random fault models, although we mainly focus on the more challenging problem of random faults. In the random fault model, the circuit, network, or algorithm is required to sort all n-input permutations with probability at least 1 -1 even if the result of each compari...
متن کاملAn Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملA Fault-tolerant Mutual Exclusion Algorithm in Asynchronous Distributed Systems
Mutual Exclusion is one of the most studied topics in distributed systems where processes communicate by asynchronous message passing. It is often necessary for multiple processes at different sites to access a shared resource or data called a critical section (CS) in distributed systems. A number of algorithms have been proposed to solve the mutual exclusion problem in distributed systems. In ...
متن کاملLegion Structure for Quorum-Based Location Management in Mobile Computing
An important issue in the design of mobile computing systems is the efficient management of location information. In this paper, we propose the Legion structure that can be used to construct schemes for distributed applications, such as location management, information dissemination, mutual exclusion, etc. We also present a new and simple distributed quorum-based location management scheme, Leg...
متن کاملA Fault-Tolerant Token-Based Mutual Exclusion Algorithm Using a Dynamic Tree
This article presents a fault tolerant extension for the NaimiTrehel token-based mutual exclusion algorithm. Contrary to the extension proposed by Naimi-Trehel, our approach minimizes the use of broadcast support by exploiting the distributed queue of token requests kept by the original algorithm. It also provides good fairness since, during failure recovery, it tries to preserve the order in w...
متن کامل